Ju n 20 14 BLOCK PARTITIONS OF SEQUENCES
نویسندگان
چکیده
Given a sequence A = (a1, . . . , an) of real numbers, a block B of the A is either a set B = {ai, ai+1, . . . , aj} where i ≤ j or the empty set. The size b of a block B is the sum of its elements. We show that when each ai ∈ [0, 1] and k is a positive integer, there is a partition of A into k blocks B1, . . . , Bk with |bi − bj| ≤ 1 for every i, j. We extend this result in several directions.
منابع مشابه
A bijection between certain non-crossing partitions and sequences
We present a bijection between non-crossing partitions of the set [2n+1] into n+1 blocks such that no block contains two consecutive integers, and the set of sequences {si}n1 such that 1 ≤ si ≤ i, and if si = j, then si−r ≤ j − r for 1 ≤ r ≤ j − 1.
متن کامل. C O ] 1 4 Ju n 20 01 Palindrome complexity
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to “class P” of Hof-Knill-Simon. We also give ...
متن کامل1 4 Ju n 20 01 Palindrome complexity
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to “class P” of Hof-Knill-Simon. We also give ...
متن کاملNote On 1-Crossing Partitions
of Kirkman (first proven by Cayley; see [7]) for the number of dissections of an n-gon using d diagonals. The goal here is to generalize Bóna’s result to count 1-crossing partitions by their number of blocks, and also to examine a natural q-analogue with regard to the cyclic sieving phenomenon shown in [8] for certain q-Catalan and q-Narayana numbers. The crux is the observation that 1-crossing...
متن کاملCompressed Sensing and Its Applications in Video Processing
My research aims at the decoding of purely compressed-sensed videos sequences. In my major work of Ph.D. studies, I considered block-based CS video transmission systems. In such systems, the transmitter/encoder partitions each video frame into non-overlapping blocks, and performs nothing more than compressed sensing acquisition of each block independently, without the benefits of the familiar s...
متن کامل